منابع مشابه
The NLC-width and clique-width for powers of graphs of bounded tree-width
The k-power graph of a graph G is a graphwith the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-treepower graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k + 2...
متن کاملDirected Tree-Width
* Partially supported by NSF under Grant No. DMS-9701598. † Research partially supported by NSF under Grant No. DMS-9401981 and by DIMACS Center, Rutgers University, New Brunswick, NJ 08903. ‡ Partially supported by ONR under Contract No. N00014-97-1-0512. §Partially supported by NSF under Grant No. DMS-9623031, by NSA under Contract No. MDA904-98-1-0517, and by DIMACS Center, Rutgers Universit...
متن کاملDirected tree-width examples
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k− 1 implies that D has a haven of order k. A negative answer is given. Furthermore they define a generalisation of the robber and cops game of [3] to digraphs. They ask whether it is true that if k cops can catch the robber on a digraph, then they can d...
متن کاملOn switching classes, NLC-width, cliquewidth and treewidth
In this paper we consider a connection between switching (of undirected graphs), and the notions of NLC-width, cliquewidth and treewidth. In particular, we show that the NLC-widths and the cliquewidths of two graphs in a switching class are at most a constant factor apart (2 for the former, 4 for the latter). A similar result can be shown not to hold for treewidth: it is easy to find a switchin...
متن کاملOn a disparity between relative cliquewidth and relative NLC-width
Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both cliqueand NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial-time if the inputs are restricted to graphs of bounded cliqueorNLC-width. Cliquewidth andNLC-width...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.11.003